package leetcode.code0064;

public class Solution extends Solution64 {

	@Override
	public int minPathSum(int[][] grid) {
		int m = grid.length;
		int n = grid[0].length;
		int[][] dp = new int[m][n];
		dp[0][0] = grid[0][0];
		for (int i = 1; i < n; i++) {
			dp[0][i] = dp[0][i - 1] + grid[0][i];// 第一行, 累加和
		}
		for (int i = 1; i < m; i++) {
			dp[i][0] = dp[i - 1][0] + grid[i][0];// 第一列, 累加和
		}
		for (int i = 1; i < m; i++) {
			for (int j = 1; j < n; j++) {
				// dp[i][j] = Math.min(从左边,从上面) + 当前格子数字
				dp[i][j] = Math.min(dp[i][j - 1], dp[i - 1][j]) + grid[i][j];
			}
		}
		return dp[m - 1][n - 1];
	}

	public static void main(String[] args) {
		Solution so = new Solution();
		so.debug1();
		so.debug2();

	}

}
